Multistep Scheduling Algorithm for Parallel and Distributed Processing in Heterogeneous Systems with Communication Costs
نویسندگان
چکیده
منابع مشابه
A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملObjective-Oriented Algorithm for Job Scheduling in Parallel Heterogeneous Systems
This paper presents a new approach to solve the problem of job scheduling for parallel processing in heterogeneous systems. The optimization goals are: (i) minimum total execution time including communication costs and (ii) shortest response time for all jobs. We introduce a classification for the given scheduling problem by the heterogeneity of the systems, from the view of the schedulers’ eye...
متن کاملTask Scheduling Algorithm for High Performance Heterogeneous Distributed Computing Systems
The main objective of task scheduling is to assign tasks onto available processors with the aim of producing minimum schedule length and without violating the precedence constraints. Several algorithms have been proposed for solving task-scheduling problem. The most of them doesn't take into account the average communication of parents and data ready time. In this paper, a new static scheduling...
متن کاملAn Optimal Scheduling Algorithm for Distributed Heterogeneous Real-Time Systems
We present a branch-and-bound algorithm to optimally schedule a set of communicating parallel real-time tasks, made up of subtasks, in a distributed heterogeneous computer system. The algorithm generates a search tree and for every tree vertex, corresponding to a partial schedule, it calculates a lower bound on the completion time of the subtasks being considered in that vertex. The algorithm t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2013
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2013/184706